An Augmented Lagrangian Method for a Class of Lmi-constrained Problems in Robust Control Theory
نویسنده
چکیده
We present a new approach to a class of non-convex LMI-constrained problem in robust control theory. The problems we consider may be recast as the minimization of a linear objective subject to linear matrix inequality (LMI) constraints in tandem with non-convex constraints related to rank conditions. We solve these problems using an extension of the augmented Lagrangian technique. The Lagrangian function combines a multiplier term and a penalty term governing the non-convex constraints. The LMI constraints, due to their special structure, are handled explicitly and not included in the Lagrangian. Global and fast local convergence of our approach is then obtained either by an LMI-constrained Newton type method including line search or by a trust-region strategy. This procedure may therefore be regarded as a sequential semi-deenite programming (SSDP) method, inspired by the sequential quadratic programming (SQP) in nonlinear optimization. The method is conveniently implemented with available SDP interior-point solvers. We compare its performance to the well-known D-K iteration scheme in robust control. Two test problems are investigated and demonstrate the power and eeciency of our approach.
منابع مشابه
Augmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems
One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...
متن کاملAugmented Lagrangian Techniques for Ellipticstate Constrained Optimal Control
We propose augmented Lagrangian methods to solve state and control constrained optimal control problems. The approachis based on the Lagrangianformulationof nonsmoothconvex optimization in Hilbert spaces developed in 6]. We investigate a linear optimal control problem with a boundary control function as in 1]. Both the equation and the constraints are augmented. The proposed methods are general...
متن کاملLPV Control for speed of permanent magnet synchronous motor (PMSM) with PWM Inverter
This paper deals with the modeling, analysis, design and simulation of a robust control method for a permanent magnet synchronous machine (PMSM) supplied with a PWM inverter based on a LPV (Linear Parameter Variation) standard controller. Under the influence of uncertainties and external disturbances, by a variation of ±150% of motor parameters from the nominal values, the robust performance c...
متن کاملSome Properties of the Augmented Lagrangian in Cone Constrained Optimization
A large class of optimization problems can be modeled as minimization of an objective function subject to constraints given in a form of set inclusions. We discuss in this paper augmented Lagrangian duality for such optimization problems. We formulate the augmented Lagrangian dual problems and study conditions ensuring existence of the corresponding augmented Lagrange multipliers. We also discu...
متن کاملLMI-Constrained Concave Programs in Robust Control
We show in the present paper that many open and challenging problems in control theory belong to the class of concave minimization programs. More precisely, these problems can be recast as the minimization of a concave objective function over convex LMI (Linear Matrix Inequality) constraints. In this setting, these problems can then be eeciently handled using local and/or global optimization te...
متن کامل